Permutations which make transitive groups primitive
نویسندگان
چکیده
منابع مشابه
Permutations Which Make Transitive Groups Primitive
In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is primitive. The remaining generators ensure transitivity or comply with specific features of the group. We show that, other than the symmetric and alternating gr...
متن کاملDoubly Transitive Permutation Groups Which Are Not Doubly Primitive
Hypothesis (A): G is a doubly transitive permutation group on a set Q. For 01 E Q, G, has a set Z = {B, , B, ,..., B,}, t > 2, which is a complete set of imprimitivity blocks on Q {a}. Let j Bi / = b > 1 for all i. Denote by H the kernel of G, on .Z and by Ki and K< the subgroups of G, fixing Bi setwise and pointwise respectively, 1 .< i < t. Let /3 E Bl . Here j Q j = 1 + ht. M. D. Atkinson ha...
متن کاملFlag-transitive Point-primitive symmetric designs and three dimensional projective special linear groups
The main aim of this article is to study (v,k,λ)-symmetric designs admitting a flag-transitive and point-primitive automorphism group G whose socle is PSL(3,q). We indeed show that the only possible design satisfying these conditions is a Desarguesian projective plane PG(2,q) and G > PSL(3,q).
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملA class of Recursive Permutations which is Primitive Recursive complete
We focus on total functions in the theory of reversible computational models. We define a class of recursive permutations, dubbed Reversible Primitive Permutations (RPP) which are computable invertible total endo-functions on integers, so a subset of total reversible computations. RPP is generated from five basic functions (identity, negation, successor, predecessor, swap), two notions of compo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2009
ISSN: 2391-5455
DOI: 10.2478/s11533-009-0050-3